Verification of Concurrent Systems Using Actl
نویسندگان
چکیده
Formal verification of concurrent systems is extensively studied in last decades. A typical verification problem consists of formally establishing a relationship between a design and a specification. The latter is usually referred to as the requirements, which the designed system must satisfy. This paper is about the requirement specification using a propositional temporal logic called action computation tree logic (ACTL). The paper presents a definition of ACTL, some usual and also some very useful new notation, and an interesting example of formal verification using ACTL.
منابع مشابه
An Action Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems
A system is described which supports proving both behavioural and logical properties of concurrent systems; these are specified by means of a process algebra and its associated logic. The logic is an action based version of the branching time logic CTL, which we call ACTL. It is interpreted over transition labelled structures while CTL is interpreted over state labelled ones. The core of the sy...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملAssisting Requirement Formalization by Means of Natural Language Translation
A prototype assistant, NL2ACTL, is presented for the formalization of behavioural requirements for the design of reactive systems. NL2ACTL is a tool for the automatic translation of Natural Language sentences, into formulae of the actionbased temporal logic ACTL. The Natural Language sentences are used to express informal requirements of reactive systems. ACTL is suitable for expressing propert...
متن کاملAn Action Computation Tree Logic With Unless Operator
This paper is about action computation tree logic (ACTL), a propositional branching-time temporal logic very suitable for specifying properties of concurrent systems described with processes. A new variant of ACTL is introduced, which is based on temporal operators until and unless, whereas all other temporal operators are derived from them. A fixed point characterisation usable for global mode...
متن کاملMerging Process Algebra and Action-based Computation Tree Logic
Process algebra and temporal logic are two popular paradigms for the specification, verification and systematic development of reactive and concurrent systems. These two approaches take different standpoint for looking at specifications and verifications, and offer complementary advantages. In order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000